Heegard-Berger and Cascade Source Coding Problems with Common Reconstruction Constraints

نویسندگان

  • Behzad Ahmadi
  • Ravi Tandon
  • Osvaldo Simeone
  • H. Vincent Poor
چکیده

In lossy source coding with side information at the decoder (i.e., the Wyner-Ziv problem), the estimate of the source obtained at the decoder cannot be generally reproduced at the encoder, due to its dependence on the side information. In some applications this may be undesirable, and a Common Reconstruction (CR) requirement, whereby one imposes that the encoder and decoder be able to agree on the decoder’s estimate, may be instead in order. The rate-distortion function under the CR constraint has been recently derived for a point-to-point (Wyner-Ziv) problem. In this paper, this result is extended to three multiterminal settings with three nodes, namely the Heegard-Berger (HB) problem, its variant with cooperating decoders and the cascade source coding problem. The HB problem consists of an encoder broadcasting to two decoders with respective side information. The cascade source coding problem is characterized by a two-hop system with side information available at the intermediate and final nodes. For the HB problem with the CR constraint, the rate-distortion function is derived under the assumption that the side information sequences are (stochastically) degraded. The rate-distortion function is also calculated explicitly for three examples, namely Gaussian source and side information with quadratic distortion metric, and binary source and side information with erasure and Hamming distortion B. Ahmadi and O. Simeone are with the CWCSPR, New Jersey Institute of Technology, Newark, NJ 07102 USA (e-mail: {behzad.ahmadi,osvaldo.simeone}@njit.edu). R. Tandon was with Princeton University, Princeton, NJ 08544 USA. He is now with Virginia Tech, Blacksburg, VA, 24061 (e-mail: [email protected], [email protected]). H. V. Poor is with Princeton University, Princeton, NJ 08544 USA (e-mail: [email protected]). The material in this paper was presented in part at the IEEE International Symposium on Information Theory, Cambridge, MA, USA, July 1-6, 2012. October 26, 2012 DRAFT

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Heegard-Berger Video Coding Using LMMSE Estimator

In this paper a novel distributed video coding scheme was proposed based on Heegard-Berger coding theorem, rather than Wyner-Ziv theorem. The main advantage of HB coding is that the decoder can still decode and output a coarse reconstruction, even if side information degrade or absent. And if side information present or upgrade at decoder, a better reconstruction can be achieved. This robust fe...

متن کامل

Polar Codes and Polar Lattices for the Heegard-Berger Problem

Explicit coding schemes are proposed to achieve the rate-distortion function of the Heegard-Berger problem using polar codes. Specifically, a nested polar code construction is employed to achieve the rate-distortion function for the doubly-symmetric binary sources when the side information may be absent. The nested structure contains two optimal polar codes for lossy source coding and channel c...

متن کامل

Distortion Minimization in Gaussian Source Coding with Fading Side Information

We consider a layered approach to source coding that minimizes expected distortion when side information is available through a fading channel. Specifically, we assume a Gaussian source encoder whereby the decoder receives a compressed version of the symbol at a given rate, as well as an uncompressed version over a separate side-information channel with slow fading and noise. The decoder knows ...

متن کامل

Your Title

Explicit coding schemes are proposed to achieve the rate-distortion bound for the Heegard-Berger problem using polar codes. Specifically, a nested polar code construction is employed to achieve the rate-distortion bound for the binary case. The nested structure contains two optimal polar codes for lossy source coding and channel coding, respectively. Moreover, a similar nested polar lattice con...

متن کامل

Distributed Source Coding using Abelian Group Codes

In this work, we consider a distributed source coding problem with a joint distortion criterion depending on the sources and the reconstruction. This includes as a special case the problem of computing a function of the sources to within some distortion and also the classic Slepian-Wolf problem [62], Berger-Tung problem [46], Wyner-Ziv problem [44], Yeung-Berger problem [47] and the Ahlswede-Ko...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 59  شماره 

صفحات  -

تاریخ انتشار 2013